منابع مشابه
A Note on Tree-width Path-width and Cutwidth*
Let tw(G), pw(G), c(G), !J.(G) denote, respectively, the tree-width, path-width, cutwidth and the maximum degree of a graph G on 11 vertices . It is known that c (G)~tw (G). We prove that c (G) =0 (tw (G)·!J.(G)·logn), and if ({Xj : iel] ,T=(I,A» is a tree decomposition of G with tree-wid~ then c (G) S (k+ l)·!J.(G)·c (T). In case that a tree decomposition is given, or that the tree-width is bo...
متن کاملTree-Width and Dimension
Over the last 30 years, researchers have investigated connections between dimension for posets and planarity for graphs. Here we extend this line of research to the structural graph theory parameter tree-width by proving that the dimension of a finite poset is bounded in terms of its height and the tree-width of its cover graph.
متن کاملConstructive Linear Time Algorithms for Small Cutwidth and Carving-Width
Consider the following problem: For any constant k and any input graph G, check whether there exists a tree T with internal vertices of degree 3 and a bijection mapping the vertices of G to the leaves of T such that for any edge of T, the number of edges of G whose end-points have preimages in diierent components of T ?e, is bounded by k. This problem is known as the Minimum Routing Tree Conges...
متن کاملRank-width and tree-width of H-minor-free graphs
We prove that for any fixed r ≥ 2, the tree-width of graphs not containing Kr as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of their rank-width. We also present refinements of our bounds for other graph classes such as Kr-minor free graphs and graphs of bounded genus.
متن کاملClique-width and tree-width of sparse graphs
Tree-width and clique-width are two important graph complexity measures that serve as parameters in many fixed-parameter tractable (FPT) algorithms. The same classes of sparse graphs, in particular of planar graphs and of graphs of bounded degree have bounded tree-width and bounded clique-width. We prove that, for sparse graphs, clique-width is polynomially bounded in terms of tree-width. For p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90171-j